General Information Constraints in Stochastic Programs Marc
نویسنده
چکیده
Scenario tree models of stochastic programs arise naturally under standard nonanticipativity assumptions. We demonstrate how tree-sparse programs cover the general case, with arbitrary information constraints. Detailed examples and intuitive interpretations illuminate the basic thoughts behind the abstract but elementary construction.
منابع مشابه
Multi-choice stochastic bi-level programming problem in cooperative nature via fuzzy programming approach
In this paper, a Multi-Choice Stochastic Bi-Level Programming Problem (MCSBLPP) is considered where all the parameters of constraints are followed by normal distribution. The cost coefficients of the objective functions are multi-choice types. At first, all the probabilistic constraints are transformed into deterministic constraints using stochastic programming approach. Further, a general tran...
متن کاملStochastic Programming with Equilibrium Constraints
In this paper we discuss here-and-now type stochastic programs with equilibrium constraints. We give a general formulation of such problems and study their basic properties such as measurability and continuity of the corresponding integrand functions. We also discuss consistency and rates of convergence of sample average approximations of such stochastic problems.
متن کاملTree-Sparse Modeling and Solution of Multistage Stochastic Programs
The lecture presents an integrated modeling and solution framework aiming at the robust and efficient solution of very large instances of tree-sparse programs. This wide class of nonlinear programs (NLP) is characterized by an underlying tree topology. It includes, in particular, dynamic stochastic programs in scenario tree formulation, multistage stochastic programs, where the objective and co...
متن کامل